Connecting Yule Process, Bisection and Binary Search Tree via Martingales
نویسندگان
چکیده مقاله:
We present new links between some remarkable martingales found in the study of the Binary Search Tree or of the bisection problem, looking at them on the probability space of a continuous time binary branching process.
منابع مشابه
Connecting Yule process, Bisection and Binary Search Tree via martingales
We present new links between some remarkable martingales found in the study of the Binary Search Tree or of the bisection problem, looking at them on the probability space of a continuous time binary branching process.
متن کاملMartingales and Profile of Binary Search Trees
We are interested in the asymptotic analysis of the binary search tree (BST) under the random permutation model. Via an embedding in a continuous time model, we get new results, in particular the asymptotic behavior of the profile.
متن کاملGraph Bisection Modeled as Binary Quadratic Task Allocation and Solved via Tabu Search
Balanced graph bisection is an NP-complete problem which partitions a set of nodes in the graph G = (N,E) into two sets with equal cardinality such that a minimal sum of edge weights exists between the nodes in the two separate sets. In this paper we transform graph bisection to capacitated task allocation using variable substitutions to remove most capacity and assignment constraints. The resu...
متن کاملEvaluation of piecewise affine control via binary search tree
We present an algorithm for generating a binary search tree that allows efficient evaluation of piecewise affine (PWA) functions defined on a polyhedral partitioning. This is useful for PWA control approaches, such as explicit model predictive control (MPC), as it allows the controller to be implemented online with small computational effort. The computation time is logarithmic in the number of...
متن کاملWord Prediction via a Clustered Optimal Binary Search Tree
Word prediction methodologies depend heavily on the statistical approach that uses the unigram, bigram, and the trigram of words. However, the construction of the N-gram model requires a very large size of memory, which is beyond the capability of many existing computers. Beside this, the approximation reduces the accuracy of word prediction. In this paper, we suggest to use a cluster of comput...
متن کاملA Delayed Yule Process
In now classic work, David Kendall (1966) recognized that the Yule process and Poisson process could be related by a (random) time change. Furthermore, he showed that the Yule population size rescaled by its mean has an almost sure exponentially distributed limit as t → ∞. In this note we introduce a class of coupled delayed continuous time Yule processes parameterized by 0 < α ≤ 1 and find a r...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ذخیره در منابع من قبلا به منابع من ذحیره شده{@ msg_add @}
عنوان ژورنال
دوره 3 شماره None
صفحات 89- 116
تاریخ انتشار 2004-11
با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023